probabilistic polynomial time造句
例句與造句
- The Atlantic City algorithms which are bounded probabilistic polynomial time algorithms are probably correct and probably fast.
- Moreover, the prover will do so in probabilistic polynomial time given access to an oracle for the language " L ".
- Assuming the conjecture that probabilistic polynomial time ( P ), the word'probabilistic'is optional in the Complexity-Theoretic Church Turing Thesis.
- A cryptosystem is "'indistinguishable under chosen plaintext "'attack if every probabilistic polynomial time adversary has only a negligible " advantage " over random guessing.
- An interactive proof system with ( P, V ) for a language L is zero-knowledge if for any probabilistic polynomial time ( PPT ) verifier \ hat V there exists an expected PPT simulator S such that
- It's difficult to find probabilistic polynomial time in a sentence. 用probabilistic polynomial time造句挺難的
- For schemes based on computational security, the adversary is modeled by a probabilistic polynomial time Turing machine, meaning that it must complete the game and output a " guess " within a polynomial number of time steps.
- Suppose the decisional Diffie Hellman assumption holds for \ mathbb F _ p, "'Naor and Reingold "'show that for every probabilistic polynomial time algorithm \ mathcal { A } and sufficiently large " n"
- Such problems cannot be approximated to any multiplicative factor by a bounded-error probabilistic algorithm unless NP = RP, because any multiplicative approximation would distinguish the values 0 and 1, effectively solving the decision version in bounded-error probabilistic polynomial time.
- Moreover, computing the permanent of a ( 0, 1 )-matrix is probabilistic polynomial time, up to an error of ? " M ", where " M " is the value of the permanent and ? > 0 is arbitrary.